Achromatic numbers and graph operations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On exponential domination and graph operations

An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v  in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....

متن کامل

Applications of Graph Operations

In this paper, some applications of our earlier results in working with chemical graphs are presented.

متن کامل

Upper bounds for the achromatic and coloring numbers of a graph

Dvořák et al. introduced a variant of the Randić index of a graph G, denoted by R′(G), where R′(G) = ∑ uv∈E(G) 1 max{d(u),d(v)} , and d(u) denotes the degree of a vertex u in G. The coloring number col(G) of a graph G is the smallest number k for which there exists a linear ordering of the vertices of G such that each vertex is preceded by fewer than k of its neighbors. It is well-known that χ(...

متن کامل

The Hyper-Zagreb Index of Graph Operations

Let G be a simple connected graph. The first and second Zagreb indices have been introduced as  vV(G) (v)2 M1(G) degG and M2(G)  uvE(G)degG(u)degG(v) , respectively, where degG v(degG u) is the degree of vertex v (u) . In this paper, we define a new distance-based named HyperZagreb as e uv E(G) . (v))2 HM(G)     (degG(u)  degG In this paper, the HyperZagreb index of the Cartesian p...

متن کامل

Characteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs

Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1992

ISSN: 0012-365X

DOI: 10.1016/0012-365x(92)90683-7